Polynomial identities of some minimal varieties with low PI - exponent

نویسنده

  • Lucio CENTRONE
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of algebras with minimal quadratic growth of identities

The main goal of this paper is to prove that the five algebras which were used in [3] to classify (up to PI-equivalence) the algebras whose sequence of codimensions is bounded by a linear function generate the only five minimal varieties of quadratic growth.

متن کامل

Minimal Varieties of Algebras of Exponential Growth

The exponent of a variety of algebras over a field of characteristic zero has been recently proved to be an integer. Through this scale we can now classify all minimal varieties of a given exponent and of finite basic rank. As a consequence we describe the corresponding T-ideals of the free algebra, and we compute the asymptotics of the related codimension sequences. We then verify in this sett...

متن کامل

Invariant varieties for polynomial dynamical systems

We study algebraic dynamical systems (and, more generally, σ-varieties) Φ : AC → AC given by coordinatewise univariate polynomials by refining an old theorem of Ritt on compositional identities amongst polynomials. More precisely, we find a nearly canonical way to write a polynomial as a composition of “clusters” from which one may easily read off possible compositional identities. Our main res...

متن کامل

On Counting Polynomials of Some Nanostructures

The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.

متن کامل

Generating Matrix Identities and Hard Instances for Strong Proof Systems

We study the complexity of generating identities of matrix rings. We establish an unconditional lower bound on the minimal number of generators needed to generate a matrix identity, where the generators are substitution instances of elements from any given finite basis of the matrix identities. Based on our findings, we propose to consider matrix identities (and their encoding) as hard instance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011